space-time clustering

space-time clustering
French\ \ -
German\ \ Raum-Zeit-Clustering
Dutch\ \ ruimte-tijd clustering
Italian\ \ -
Spanish\ \ espacio-tiempo de agrupamiento
Catalan\ \ -
Portuguese\ \ agrupamento espaço-temporal; agregação espaço-temporal; agrupamento espácio-temporal; agregação espácio-temporal;
Romanian\ \ -
Danish\ \ -
Norwegian\ \ -
Swedish\ \ rum-tidsklustring
Greek\ \ χώρο-χρόνο συσπείρωση
Finnish\ \ tila–aika ryvästys
Hungarian\ \ tér-idõ klaszterezés
Turkish\ \ uzay-zaman kümeleşmesi; mekan-zaman kümeleşmesi
Estonian\ \ ruumi-aja-klasterdus
Lithuanian\ \ erdvėlaikio grupavimas
Slovenian\ \ -
Polish\ \ klasteryzacja czasowo-przestrzenna
Russian\ \ пространственно-временная кластеризация
Ukrainian\ \ -
Serbian\ \ -
Icelandic\ \ rúm-tími þyrping
Euskara\ \ -
Farsi\ \ -
Persian-Farsi\ \ -
Arabic\ \ عنقدة المكان - الزمان
Afrikaans\ \ ruimte-tyd-trosvorming
Chinese\ \ 空 间 ― 时 间 聚 类
Korean\ \ 시공간 군집화

Statistical terms. 2014.

Игры ⚽ Нужно сделать НИР?

Look at other dictionaries:

  • Consensus clustering — Clustering is the assignment of objects into groups (called clusters) so that objects from the same cluster are more similar to each other than objects from different clusters. Often similarity is assessed according to a distance measure.… …   Wikipedia

  • Data stream clustering — In computer science, data stream clustering is defined as the clustering of data that arrive continuously such as telephone records, multimedia data, financial transactions etc. Data stream clustering is usually studied under the data stream… …   Wikipedia

  • k-means clustering — In statistics and data mining, k means clustering is a method of cluster analysis which aims to partition n observations into k clusters in which each observation belongs to the cluster with the nearest mean. This results into a partitioning of… …   Wikipedia

  • CURE data clustering algorithm — CURE (Clustering Using REpresentatives) is an efficient data clustering algorithm for large databases that is more robust to outliers and identifies clusters having non spherical shapes and wide variances in size. Contents 1 Drawbacks of… …   Wikipedia

  • Correlation clustering — In machine learning, correlation clustering or cluster editing operates in a scenario where the relationship between the objects are known instead of the actual representation of the objects. For example, given a signed graph G = (V,E) where the… …   Wikipedia

  • cosmos — /koz meuhs, mohs/, n., pl. cosmos, cosmoses for 2, 4. 1. the world or universe regarded as an orderly, harmonious system. 2. a complete, orderly, harmonious system. 3. order; harmony. 4. any composite plant of the genus Cosmos, of tropical… …   Universalium

  • Hash table — Not to be confused with Hash list or Hash tree. Unordered map redirects here. For the proposed C++ class, see unordered map (C++). Hash Table Type unsorted dictionary Invented 1953 Time complexity in big O notation Average Worst case Space …   Wikipedia

  • David Mount — Not to be confused with David W. Mount, Professor Emeritus of Molecular and Cellular Biology at the University of Arizona. David Mount is currently a Professor at The University of Maryland (College Park Campus) whose research is in Computational …   Wikipedia

  • Dark matter — Not to be confused with antimatter, dark energy, dark fluid or dark flow. For other uses, see Dark Matter (disambiguation) …   Wikipedia

  • General relativity — For a generally accessible and less technical introduction to the topic, see Introduction to general relativity. General relativity Introduction Mathematical formulation Resources …   Wikipedia

  • Big Bang — This article is about the cosmological model. For the sitcom, see The Big Bang Theory. For other uses, see Big Bang (disambiguation) …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”